More Torsion in the Homology of the Matching Complex

نویسنده

  • Jakob Jonsson
چکیده

Using computers, we analyze the integral homology of the matching complex Mn, which is the simplicial complex of matchings in the complete graph on n vertices. Our main result is the detection of p-torsion in the homology for p ∈ {5, 7, 11, 13}. Specifically, we show that there is nonvanishing 5-torsion in the homology of Mn for n ≥ 18 and for n ∈ {14, 16}. The only previously known value was n = 14, and in this particular case we have a new computer-free proof. Moreover, we show that there is 7-torsion in the homology of Mn for all odd n between 23 and 41 and for n = 30. In addition, there is 11-torsion in the homology of M47 and 13-torsion in the homology of M62. Finally, we compute the ranks of the 3and 5-subgroups of H̃d(Mn; Z) for 13 ≤ n ≤ 16; a complete description of the homology already exists for n ≤ 12. To prove our results, we use a representation-theoretic approach, examining subcomplexes of the chain complex of Mn obtained by letting certain groups act on the chain complex.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Five-torsion in the homology of the matching complex on 14 vertices

J.L. Andersen proved that there is 5-torsion in the bottom nonvanishing homology group of the simplicial complex of graphs of degree at most two on seven vertices. We use this result to demonstrate that there is 5-torsion also in the bottom nonvanishing homology group of the matching complex M14 on 14 vertices. Combining our observation with results due to Bouc and to Shareshian and Wachs, we c...

متن کامل

3-torsion in the homology of complexes of graphs of bounded degree

For δ ≥ 1 and n ≥ 1, we examine the simplicial complex of graphs on n vertices in which each vertex has degree at most δ; we identify a given graph with its edge set and admit one loop at each vertex. δ = 1 yields the matching complex, and it is known that there is 3-torsion in degree d of the homology of this complex whenever n−4 3 ≤ d ≤ n−6 2 . We establish similar bounds for δ ≥ 2. Specifica...

متن کامل

Sex-related Left Ventricle Rotational and Torsional Mechanics by Block Matching Algorithm

Background: The aim of the present study was to evaluate how left ventricular twist and torsion are associated with sex between sex groups of the same age.Materials and Methods: In this analytical study, twenty one healthy subjects were scanned in left ventricle basal and apical short axis views to run the block matching algorithm; instantaneous changes in the base and apex rotation angel...

متن کامل

Topology of Matching, Chessboard, and General Bounded Degree Graph Complexes

We survey results and techniques in the topological study of simplicial complexes of (di-, multi-, hyper-)graphs whose node degrees are bounded from above. These complexes have arisen is a variety of contexts in the literature. The most wellknown examples are the matching complex and the chessboard complex. The topics covered here include computation of Betti numbers, representations of the sym...

متن کامل

Exact sequences for the homology of the matching complex

Building on work by Bouc and by Shareshian and Wachs, we provide a toolbox of long exact sequences for the reduced simplicial homology of the matching complex Mn, which is the simplicial complex of matchings in the complete graph Kn. Combining these sequences in different ways, we prove several results about the 3-torsion part of the homology of Mn. First, we demonstrate that there is nonvanish...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Experimental Mathematics

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2010